1,226,917 research outputs found
Active Semi-Supervised Learning Using Sampling Theory for Graph Signals
We consider the problem of offline, pool-based active semi-supervised
learning on graphs. This problem is important when the labeled data is scarce
and expensive whereas unlabeled data is easily available. The data points are
represented by the vertices of an undirected graph with the similarity between
them captured by the edge weights. Given a target number of nodes to label, the
goal is to choose those nodes that are most informative and then predict the
unknown labels. We propose a novel framework for this problem based on our
recent results on sampling theory for graph signals. A graph signal is a
real-valued function defined on each node of the graph. A notion of frequency
for such signals can be defined using the spectrum of the graph Laplacian
matrix. The sampling theory for graph signals aims to extend the traditional
Nyquist-Shannon sampling theory by allowing us to identify the class of graph
signals that can be reconstructed from their values on a subset of vertices.
This approach allows us to define a criterion for active learning based on
sampling set selection which aims at maximizing the frequency of the signals
that can be reconstructed from their samples on the set. Experiments show the
effectiveness of our method.Comment: 10 pages, 6 figures, To appear in KDD'1
S2: An Efficient Graph Based Active Learning Algorithm with Application to Nonparametric Classification
This paper investigates the problem of active learning for binary label
prediction on a graph. We introduce a simple and label-efficient algorithm
called S2 for this task. At each step, S2 selects the vertex to be labeled
based on the structure of the graph and all previously gathered labels.
Specifically, S2 queries for the label of the vertex that bisects the *shortest
shortest* path between any pair of oppositely labeled vertices. We present a
theoretical estimate of the number of queries S2 needs in terms of a novel
parametrization of the complexity of binary functions on graphs. We also
present experimental results demonstrating the performance of S2 on both real
and synthetic data. While other graph-based active learning algorithms have
shown promise in practice, our algorithm is the first with both good
performance and theoretical guarantees. Finally, we demonstrate the
implications of the S2 algorithm to the theory of nonparametric active
learning. In particular, we show that S2 achieves near minimax optimal excess
risk for an important class of nonparametric classification problems.Comment: A version of this paper appears in the Conference on Learning Theory
(COLT) 201
Active Learning for Undirected Graphical Model Selection
This paper studies graphical model selection, i.e., the problem of estimating
a graph of statistical relationships among a collection of random variables.
Conventional graphical model selection algorithms are passive, i.e., they
require all the measurements to have been collected before processing begins.
We propose an active learning algorithm that uses junction tree representations
to adapt future measurements based on the information gathered from prior
measurements. We prove that, under certain conditions, our active learning
algorithm requires fewer scalar measurements than any passive algorithm to
reliably estimate a graph. A range of numerical results validate our theory and
demonstrates the benefits of active learning.Comment: AISTATS 201
Active Learning: Effects of Core Training Design Elements on Self-Regulatory Processes, Learning, and Adaptability
This research describes a comprehensive examination of the cognitive, motivational, and emotional processes underlying active learning approaches, their effects on learning and transfer, and the core training design elements (exploration, training frame, emotion-control) and individual differences (cognitive ability, trait goal orientation, trait anxiety) that shape these processes. Participants (N = 350) were trained to operate a complex computer-based simulation. Exploratory learning and error-encouragement framing had a positive effect on adaptive transfer performance and interacted with cognitive ability and dispositional goal orientation to influence trainees’ metacognition and state goal orientation. Trainees who received the emotion-control strategy had lower levels of state anxiety. Implications for developing an integrated theory of active learning, learner-centered design, and research extensions are discussed
Learning perception and planning with deep active inference
Active inference is a process theory of the brain that states that all living organisms infer actions in order to minimize their (expected) free energy. However, current experiments are limited to predefined, often discrete, state spaces. In this paper we use recent advances in deep learning to learn the state space and approximate the necessary probability distributions to engage in active inference
Using pattern languages to mediate theory–praxis conversations in design for networked learning
Educational design for networked learning is becoming more complex but also more inclusive, with teachers and learners playing more active roles in the design of tasks and of the learning environment. This paper connects emerging research on the use of design patterns and pattern languages with a conception of educational design as a conversation between theory and praxis. We illustrate the argument by drawing on recent empirical research and literature reviews from the field of networked learning
Adaptivity to Noise Parameters in Nonparametric Active Learning
This work addresses various open questions in the theory of active learning
for nonparametric classification. Our contributions are both statistical and
algorithmic: -We establish new minimax-rates for active learning under common
\textit{noise conditions}. These rates display interesting transitions -- due
to the interaction between noise \textit{smoothness and margin} -- not present
in the passive setting. Some such transitions were previously conjectured, but
remained unconfirmed. -We present a generic algorithmic strategy for adaptivity
to unknown noise smoothness and margin; our strategy achieves optimal rates in
many general situations; furthermore, unlike in previous work, we avoid the
need for \textit{adaptive confidence sets}, resulting in strictly milder
distributional requirements
Active Learning and Best-Response Dynamics
We examine an important setting for engineered systems in which low-power
distributed sensors are each making highly noisy measurements of some unknown
target function. A center wants to accurately learn this function by querying a
small number of sensors, which ordinarily would be impossible due to the high
noise rate. The question we address is whether local communication among
sensors, together with natural best-response dynamics in an
appropriately-defined game, can denoise the system without destroying the true
signal and allow the center to succeed from only a small number of active
queries. By using techniques from game theory and empirical processes, we prove
positive (and negative) results on the denoising power of several natural
dynamics. We then show experimentally that when combined with recent agnostic
active learning algorithms, this process can achieve low error from very few
queries, performing substantially better than active or passive learning
without these denoising dynamics as well as passive learning with denoising
- …